Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Aspect-based sentiment analysis model fused with multi-window local information
Zhixiong ZHENG, Jianhua LIU, Shuihua SUN, Ge XU, Honghui LIN
Journal of Computer Applications    2023, 43 (6): 1796-1802.   DOI: 10.11772/j.issn.1001-9081.2022060891
Abstract264)   HTML9)    PDF (1323KB)(98)       Save

Focused on the issue that the current Aspect-Based Sentiment Analysis (ABSA) models rely too much on the syntactic dependency tree with relatively sparse relationships to learn feature representations, which leads to the insufficient ability of the model to learn local information, an ABSA model fused with multi-window local information called MWGAT (combining Multi-Window local information and Graph ATtention network) was proposed. Firstly, the local contextual features were learned through the multi-window local feature learning mechanism, and the potential local information contained in the text was mined. Secondly, Graph ATtention network (GAT), which can better understand the syntactic dependency tree, was used to learn the syntactic structure information represented by the syntactic dependency tree, and syntax-aware contextual features were generated. Finally, these two types of features representing different semantic information were fused to form the feature representation containing both the syntactic information of syntactic dependency tree and the local information, so that the sentiment polarities of aspect words were discriminated by the classifier efficiently. Three public datasets, Restaurant, Laptop, and Twitter were used for experiment. The results show that compared with the T-GCN (Type-aware Graph Convolutional Network) model combined with the syntactic dependency tree, the proposed model has the Macro-F1 score improved by 2.48%, 2.37% and 0.32% respectively. It can be seen that the proposed model can mine potential local information effectively and predict the sentiment polarities of aspect words more accurately.

Table and Figures | Reference | Related Articles | Metrics
Improvement of DV-Hop localization based on shuffled frog leaping algorithm
Yu GE Xue-ping WANG Jing LIANG
Journal of Computer Applications    2011, 31 (04): 922-924.   DOI: 10.3724/SP.J.1087.2011.00922
Abstract1722)      PDF (610KB)(444)       Save
In order to reduce the node localization error of DV-Hop algorithm in Wireless Sensor Network (WSN), a calculation method of average distance per hop was adjusted by using the shuffled frog leaping algorithm. The improved DV-Hop algorithm makes the average distance per hop closer to the actual value, thereby reducing the localization error. The simulation results indicate that the improved DV-Hop algorithm reduces localization error effectively and has good stability without additional devices; therefore, it is a practical localization solution for WSN.
Related Articles | Metrics